Fully abstract from static to gradual
نویسندگان
چکیده
منابع مشابه
Gradual Abstract Proof Search
Gradual Abstract Proof Search (GAPS) is a new 2-player search technique. It has been used to prove that 11x11 Phutball is a win for the first player in 25 plies or less, that 6x6 Atari-Go with a crosscut in the center is a win for the first player in 15 plies or less. I give domain dependent optimizations for the two games. I also describe theoretical and experimental comparisons with other rel...
متن کاملFrom Static to Dynamic Abstract Data-Types: An Institution Transformation
We show how to extend in a canonical way a given formalism for specifying (static) data types (like usual algebraic specification frameworks) with dynamic features. What we obtain in this way is a corresponding formalism for specifying dynamic data-types based on the " state-as-algebra " approach: a dynamic data-type models a dynamically evolving system in which any state can be viewed as a sta...
متن کاملNondeterminism and Fully Abstract Models
— We study the semantics ofsome nondeterministic languages derivedfrom PCF [8]. In particular we discuss how Milner" s results in [5] can (or cannoi) be applied to obtain models,for our languages, which arefully abstract with respect to the (standard) operational semantics. Résumé. — Nous étudions ici la sémantique de quelques langages non déterministes, dérivés du PCF [8]. En particulier, nous...
متن کاملA Fully Abstract Semantics for Constructor Systems
Constructor-based term rewriting systems are a useful subclass of TRS, in particular for programming purposes. In this kind of systems constructors determine a universe of values, which are the expected output of the computations. Then it would be natural to think of a semantics associating each expression to the set of its reachable values. Somehow surprisingly, the resulting semantics has poo...
متن کاملFully abstract models of programming languages
We present a theory of fully abstract denotational semantics of programming languages. Following initial algebra semantics, syntax is specified by manysorted signatures, and models are universal algebras whose carriers are complete partial orders and operations are continuous. The informal requirement that the meanings of iteration and recursion constructs be least fixed points of appropriate u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on Programming Languages
سال: 2021
ISSN: 2475-1421,2475-1421
DOI: 10.1145/3434288